Underspecification for a simple process algebra of recursive processes
نویسندگان
چکیده
منابع مشابه
Process Algebra with Recursive Operations
3 Axiomatisation of the Binary Kleene Star 15 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Completeness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Irredundancy of the Axioms . . . . . . . . . . . . . . . . . . . . . . . 24 3.4 Negative Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.5 Extensions of BPA∗(A...
متن کاملEquivalence of recursive specifications in process algebra
We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language μCRL. 2001 Elsevier Science B.V. All rights reserved.
متن کاملProcess Algebra Modelling Styles for Biomolecular Processes
We investigate how biomolecular processes are modelled in process algebras, focussing on chemical reactions. We consider various modelling styles and how design decisions made in the definition of the process algebra have an impact on how a modelling style can be applied. Our goal is to highlight the often implicit choices that modellers make in choosing a formalism, and illustrate, through the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00419-9